Functional equations on finite groups of substitutions
نویسندگان
چکیده
منابع مشابه
ON THE CHARACTERISTIC DEGREE OF FINITE GROUPS
In this article we introduce and study the concept of characteristic degree of a subgroup in a finite group. We define the characteristic degree of a subgroup H in a finite group G as the ratio of the number of all pairs (h,α) ∈ H×Aut(G) such that h^α∈H, by the order of H × Aut(G), where Aut(G) is the automorphisms group of G. This quantity measures the probability that H can be characteristic ...
متن کاملthe effect of functional/notional approach on the proficiency level of efl learners and its evaluation through functional test
in fact, this study focused on the following questions: 1. is there any difference between the effect of functional/notional approach and the structural approaches to language teaching on the proficiency test of efl learners? 2. can a rather innovative language test referred to as "functional test" ge devised so so to measure the proficiency test of efl learners, and thus be as much reliable an...
15 صفحه اولOn Laplacian energy of non-commuting graphs of finite groups
Let $G$ be a finite non-abelian group with center $Z(G)$. The non-commuting graph of $G$ is a simple undirected graph whose vertex set is $Gsetminus Z(G)$ and two vertices $x$ and $y$ are adjacent if and only if $xy ne yx$. In this paper, we compute Laplacian energy of the non-commuting graphs of some classes of finite non-abelian groups..
متن کاملVariables Separated Equations and Finite Simple Groups
[UMSt] www.math.uci.edu/ ̃mfried/paplist-cov/UMStory.html. Algebraic equations in separated variables: (*) f(x)−g(y) = 0. Defines a projective nonsingular algebraic curve Xf,g with two projections to the (Riemann sphere) z-line Pz = C ∪ {∞}: f : Px → Pz and g : Py → Pz. Two problems from the 60s (Davenport’s and Shinzel’s) solved by the monodromy method . I explain that and the associated Genus ...
متن کاملLinear equations over finite abelian groups
One of the oldest problems in algebra is the solution of a system of linear equations over certain domains. The Gaussian elimination algorithm provides an effective solution over fields. The Smith normal form algorithm yields a method over the integers. Here we consider another variation of this theme. Let A be a finite (additive) abelian group, let αi,j ∈ End(A) for 1 ≤ i ≤ n and 1 ≤ j ≤ m and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expositiones Mathematicae
سال: 2012
ISSN: 0723-0869
DOI: 10.1016/j.exmath.2012.03.004